Yet More Projective Curves over F2

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Yet More Projective Curves over F2

All plane curves of degree less than 7 with coefficients in F2 are examined for curves with a large number of Fq rational points on their smooth model, for q = 2,m = 3, 4, ..., 11. Known lower bounds are improved, and new curves are found meeting or close to Serre’s, Lauter’s, and Ihara’s upper bounds for the maximal number of Fq rational points on a curve of genus g.

متن کامل

On C-fibrations over Projective Curves

The goal of this paper is to present a modified version (GML) of ML invariant which should take into account rulings over a projective base and allow further stratification of smooth affine rational surfaces. We provide a non-trivial example where GML invariant is computed for a smooth affine rational surface admitting no C-actions. We apply GML invariant to computing ML invariant of some three...

متن کامل

Algebraic curves over F2 with many rational points

A smooth, projective, absolutely irreducible curve of genus 19 over F2 admitting an infinite S-class field tower is presented. Here S is a set of four F2-rational points on the curve. This is shown to imply that A(2) = limsup#X(F2)/g(X) ≥ 4/(19 − 1) ≈ 0.222. Here the limit is taken over curves X over F2 of genus g(X)→∞.

متن کامل

Computing in Picard groups of projective curves over finite fields

We give algorithms for computing with divisors on projective curves over finite fields, and with their Jacobians, using the algorithmic representation of projective curves developed by Khuri-Makdisi. We show that various desirable operations can be performed efficiently in this setting: decomposing divisors into prime divisors; computing pull-backs and push-forwards of divisors under finite mor...

متن کامل

Polynomial factorization over F2

We describe algorithms for polynomial factorization over the binary field F2, and their implementation. They allow polynomials of degree up to 250 000 to be factored in about one day of CPU time, distributing the work on two processors.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Experimental Mathematics

سال: 2002

ISSN: 1058-6458,1944-950X

DOI: 10.1080/10586458.2002.10504705